/* Copyright 2009
 *
 * This program and the accompanying materials
 * are made available under the terms of the
 * Eclipse Public License v1.0 which accompanies
 * this distribution, and is available at
 *
 * 		http://www.eclipse.org/legal/epl-v10.html
 *
 * Unless required by applicable law or agreed to in
 * writing, software distributed under the License is
 * distributed on an "AS IS" BASIS, WITHOUT WARRANTIES
 * OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing
 * permissions and limitations under the License.
 *
 * Contributors:
 * 	   IBM Corporation - initial API and implementation for JDT/DLTK
 *     Sean W. Quinn - initial adoption for use with PHP from various sources.
 */
package org.eclipse.php.internal.core.parser;


/**
 * @author Sean W. Quinn (swquinn@gmail.com)
 *
 */
public class PHPParserResult {
//  private final List beginNodes = new ArrayList();
//  private Node ast;
//  private boolean endSeen;
//  private List commentNodes = new ArrayList();
//  private DynamicScope scope;
//
//  public List getCommentNodes() {
//      return commentNodes;
//  }
//
//  public Node getAST() {
//      return ast;
//  }
//
//  public DynamicScope getScope() {
//      return scope;
//  }
//
//  public void setScope(DynamicScope scope) {
//      this.scope = scope;
//  }
//
//  /**
//   * Sets the ast.
//   * @param ast The ast to set
//   */
//  public void setAST(Node ast) {
//      this.ast = ast;
//  }
//
//  public void addComment(CommentNode node) {
//      commentNodes.add(node);
//  }
//
//  public void addBeginNode(StaticScope scope, Node node) {
//      // FIXME: We need to add BEGIN nodes properly
//    beginNodes.add(node);
//  }
//
//  public void addAppendBeginNodes() {
//    if (beginNodes.isEmpty()) return;
//
//      BlockNode n;
//    if (getAST() != null) {
//      n = new BlockNode(getAST().getPosition());
//    } else {
//      n = new BlockNode(((Node) beginNodes.get(0)).getPosition());
//    }
//    for (int i = 0; i < beginNodes.size(); i++) {
//      n.add((Node) beginNodes.get(i));
//    }
//    if (getAST() != null) n.add(getAST());
//
//    setAST(n);
//  }
//
//  public boolean isEndSeen() {
//    return endSeen;
//  }
//
//  public void setEndSeen(boolean endSeen) {
//    this.endSeen = endSeen;
//  }
}
